package My;

import java.util.List;
import java.util.Scanner;

public class Test {
    public static void main(String[] args) {
        BinaryTree binaryTree=new BinaryTree();
        BinaryTree.TreeNode root=binaryTree.createTree();
       // binaryTree.preOrder(root);
        //System.out.println();
       /* binaryTree.inOrder(root);
        System.out.println();
        binaryTree.postOrder(root);*/
       // System.out.println(binaryTree.getleftszie(root));
       // System.out.println(binaryTree.size(root));
       // System.out.println(binaryTree.getlevelsize(root,3));
       // System.out.println(binaryTree.gethigh(root));
       // System.out.println(binaryTree.find(root,'B').val);
        //List<List<Character>> ret =binaryTree.levelOrder2(root);
        //System.out.println(ret);
       // System.out.println(binaryTree.isCompleteTree(root));
        //binaryTree.treeconvertlianbiaozhongxu2(root);

    }
}
